Irreducible polynomials with consecutive zero coefficients
نویسندگان
چکیده
منابع مشابه
Irreducible polynomials with consecutive zero coefficients
Given an integer n > 1, it has been proved independently by S.D. Cohen [2] and R. Ree [13], that for all large enough q, there always is an irreducible polynomial over Fq of the form T +T +a. However, much less is known when q is fixed and n large. In [10], T. Hansen and G.L. Mullen conjecture that given integers n > m ≥ 0 there exists a monic irreducible polynomial over Fq of degree n with the...
متن کاملIrreducible polynomials with several prescribed coefficients
We study the number of monic irreducible polynomials of degree n over Fq having certain preassigned coefficients, where we assume that the constant term (if preassigned) is nonzero. Hansen and Mullen conjectured that for n ≥ 3, one can always find an irreducible polynomial with any one coefficient preassigned (regardless of the ground field Fq). Their conjecture was established in all but finit...
متن کاملIrreducible Polynomials over GF(2) with Three Prescribed Coefficients
For an odd positive integer n, we determine formulas for the number of irreducible polynomials of degree n over GF (2) in which the coefficients of xn−1, xn−2 and xn−3 are specified in advance. Formulas for the number of elements in GF (2n) with the first three traces specified are also given. Let q be a prime power and let GF (q) be a finite field with q elements. A classical result (see [6, 3...
متن کاملThe Number of Irreducible Polynomials with First Two Prescribed Coefficients over a Finite Field
We use elementary combinatorial methods together with the theory of quadratic forms over finite fields to obtain the formula, originally due to Kuz’min, for the number of monic irreducible polynomials of degree n over a finite field Fq with first two prescribed coefficients. The formula relates the number of such irreducible polynomials to the number of polynomials that split over the base field.
متن کاملPolynomials with Nonnegative Coefficients
The authors verify the conjecture that a conjugate pair of zeros can be factored from a polynomial with nonnegative coefficients so that the resulting polynomial still has nonnegative coefficients. The conjecture was originally posed by A. Rigler, S. Trimble, and R. Varga arising out of their work on the Beauzamy-Enflo generalization of Jensen's inequality. The conjecture was also made independ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2008
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2006.11.002